home *** CD-ROM | disk | FTP | other *** search
/ Aminet 5 / Aminet 5 - March 1995.iso / Aminet / dev / misc / LEDA_gene.lha / LEDA-3.1c-generic / man / Contents.tex < prev    next >
Encoding:
Text File  |  1994-08-05  |  5.2 KB  |  128 lines
  1.  
  2. {\magtwo Table of Contents}
  3. \medskip
  4. \halign {
  5. #\       &#\dotfill&\hfil#\cr
  6. {\bf 0} &{\bf Introduction}                               &1\cr
  7. \cr
  8. {\bf 1} &{\bf Basics}                                     &3\cr
  9. \cr
  10. 1.1    &A First Example                                   &3\cr
  11. 1.2    &Specifications                                    &3\cr
  12. 1.3    &Implementation Parameters                         &6\cr
  13. 1.4    &Arguments                                         &7\cr
  14. 1.5    &Overloading                                       &8\cr
  15. 1.6    &Linear Orders                                     &8\cr
  16. 1.7    &Items                                             &11\cr
  17. 1.8    &Iteration                                         &12\cr
  18. 1.9    &Header Files                                      &13\cr
  19. 1.10   &Libraries                                         &13\cr
  20. \cr
  21. \cr
  22. {\bf 2} &{\bf Simple Data Types}                          &15\cr
  23. \cr
  24. 2.1    &Boolean ($bool$)                                  &15\cr
  25. 2.2    &Strings ($string$)                                &16\cr
  26. 2.3    &Real-valued vectors  ($vector$)                   &18\cr
  27. 2.4    &Real-valued matrices ($matrix$)                   &19\cr
  28. \cr
  29. \cr
  30. {\bf 3} &{\bf Basic Data Types}                           &21\cr
  31. \cr
  32. 3.1    &One Dimensional Arrays ($array$)                  &21\cr
  33. 3.2    &Two Dimensional Arrays ($array2$)                 &23\cr
  34. 3.3    &Stacks         ($stack$)                          &24\cr
  35. 3.4    &Queues         ($queue$)                          &25\cr
  36. 3.5    &Bounded Stacks ($b\_stack$)                       &26\cr
  37. 3.6    &Bounded Queues ($b\_queue$)                       &27\cr
  38. 3.7    &Lists          ($list$)                           &28\cr
  39. 3.8    &Sets           ($set$)                            &33\cr
  40. 3.9    &Integer Sets   ($int\_set$)                       &34\cr
  41. 3.10   &Partitions     ($partition$)                      &35\cr
  42. 3.11   &Dynamic collections of trees ($tree\_collection$) &36\cr
  43. \cr
  44. \cr
  45. {\bf 4} &{\bf Priority Queues and Dictionaries }          &39\cr
  46. \cr
  47. 4.1      &Priority Queues   ($priority\_queue$)           &39\cr
  48. 4.2      &Bounded Priority Queues ($b\_priority\_queue$)  &41\cr
  49. 4.3      &Dictionaries      ($dictionary$)                &42\cr
  50. 4.4      &Dictionary Arrays ($d\_array$)                  &44\cr
  51. 4.5      &Hashing Arrays    ($h\_array$)                  &46\cr
  52. 4.6      &Sorted Sequences  ($sortseq$)                   &47\cr
  53. 4.7      &Persistent Dictionaries ($p\_dictionary$)       &50\cr
  54. \cr
  55. \cr
  56. {\bf 5} &{\bf Graphs and Related Data Types}              &53\cr
  57. \cr
  58. 5.1    &Graphs ($graph$)                                  &53\cr
  59. 5.2    &Undirected Graphs ($ugraph$)                      &57\cr
  60. 5.3    &Planar Maps ($planar\_map$)                       &59\cr
  61. 5.4    &Parameterized Graphs ($GRAPH$)                    &61\cr
  62. 5.5    &Parameterized Undirected Graphs ($UGRAPH$)        &63\cr
  63. 5.6    &Parameterized Planar Maps ($PLANAR\_MAP$)         &64\cr
  64. 5.7    &Node and Edge Arrays ($node\_array, edge\_array$) \hbox to 5 truecm{\dotfill}&65\cr
  65. 5.8    &Two Dimensional Node Arrays ($node\_matrix$)      &67\cr
  66. 5.9    &Node and Edge Sets  ($node\_set, edge\_set$)      &68\cr
  67. 5.10   &Node Partitions ($node\_partition$)               &69\cr
  68. 5.11   &Node Priority Queues ($node\_pq$)                 &70\cr
  69. 5.12   &Graph Algorithms                                  &71\cr
  70. 5.13   &Miscellaneous                                     &77\cr
  71. \cr
  72. \cr
  73. \cr
  74. {\bf 6} &{\bf Two-Dimensional Geometry}                   &79\cr
  75. \cr
  76. 6.1   &Basic two-dimensional objects                      &79\cr
  77. 6.2   &Two-Dimensional Dictionaries ($d2\_dictionary$)    &88\cr
  78. 6.3   &Sets of Points ($point\_set$)                      &90\cr
  79. 6.4   &Sets of Intervals ($interval\_set$)                &92\cr
  80. 6.5   &Sets of Parallel Segments ($segment\_set$)         &94\cr
  81. 6.6   &Planar Subdivision ($subdivision$)                 &96\cr
  82. 6.7   &Graphic Windows ($window$)                         &97\cr
  83. 6.7   &Panels ($panel$)                                   &106\cr
  84. \cr
  85. \cr
  86. \cr
  87. {\bf 7} &{\bf Miscellaneous}                              &109\cr
  88. \cr
  89. 7.1   &Streams                                            &109\cr
  90. 7.2   &Useful Functions                                   &112\cr
  91. 7.3   &Memory Management                                  &113\cr
  92. 7.4   &Error Handling                                     &113\cr
  93. \cr
  94. \cr
  95. {\bf 8} &{\bf Programs}                                   &115\cr
  96. \cr
  97. 8.1   & Graph and Network Algorithms                      &115\cr
  98. 8.2   & Computational Geometry                            &124\cr
  99. \cr
  100. \cr
  101. {\bf 9} &{\bf Implementations}                            &127\cr
  102. \cr
  103. 9.1   &List of Data Structures                            &127\cr
  104. 9.2   &User Implementations                               &128\cr
  105. \cr
  106. \cr
  107. {\bf 10} &{\bf Tables}                                    &133\cr
  108. \cr
  109. 10.1  &Data Types                                         &133\cr
  110. 10.2  &Algorithms                                         &135\cr
  111. \cr
  112. \cr
  113. {\bf 11} &{\bf References}                                &137\cr
  114. }
  115.  
  116. \vfill
  117.  
  118. {\magtwo  Acknowledgement}
  119.  
  120. The author would like to thank Kurt Mehlhorn for many helpful suggestions and 
  121. valuable comments.
  122.  
  123. \vglue 1cm
  124. \eject
  125.  
  126. \vglue 10cm
  127. \vfill\eject
  128.